Computing the Number of Mergings with Constraints
نویسندگان
چکیده
A merging of two ordered lists x 1 ..... Xp and Yl,-. ,Yq is said to be constrained if it must satisfy prescribed conditions of the form "x i precedes yj" and "y, precedes xs". An algorithm is given for calculating the number of mergings which satisfy any given set of constraints. The algorithm has time complexity O(pq) but in many cases runs significantly faster. It is illustrated with examples which involve the Catalan and Fibonacci numbers.
منابع مشابه
Application of Network RTK Positions and Geometric Constraints to the Problem of Attitude Determination Using the GPS Carrier Phase Measurements
Nowadays, navigation is an unavoidable fact in military and civil aerial transportations. The Global Positioning System (GPS) is commonly used for computing the orientation or attitude of a moving platform. The relative positions of the GPS antennas are computed using the GPS code and/or phase measurements. To achieve a precise attitude determination, Carrier phase observations of GPS requiring...
متن کاملA Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملConcurrent Discretization of Multiple Attributes
Better decision trees can be learnt by merging continuous values into intervals Merging of values however could introduce incon sistencies to the data or information loss When it is desired to maintain a certain consistency interval mergings in one attribute could disable those in another attribute This interaction raises the issue of determin ing the order of mergings We consider a globally gr...
متن کاملAN EFFICIENT OPTIMIZATION PROCEDURE BASED ON CUCKOO SEARCH ALGORITHM FOR PRACTICAL DESIGN OF STEEL STRUCTURES
Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 24 شماره
صفحات -
تاریخ انتشار 1987